Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
نویسندگان
چکیده
This short communication analyses a boundedness property of the inverse of a Jacobian matrix that arises in regularized primal-dual interior-point methods for linear and nonlinear programming. This result should be a useful tool for the convergence analysis of these kinds of methods.
منابع مشابه
Inexact constraint preconditioners for linear systems arising in interior point methods
Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior point methods are addressed in this paper. Constraint preconditioners have shown much promise in this context. However, there are situations in which an unfavorable sparsity pattern of Jacobian matrix may adversely affect the preconditioner and make its inverse representation unacceptably dense ...
متن کاملInexact Jacobian Constraint Preconditioners in Optimization
In this paper we analyze a class of approximate constraint preconditioners in the acceleration of Krylov subspace methods fot the solution of reduced Newton systems arising in optimization with interior point methods. We propose a dynamic sparsification of the Jacobian matrix at every stage of the interior point method. Spectral analysis of the preconditioned matrix is performed and bounds on i...
متن کاملMatrix-free interior point method
In this paper we present a redesign of a linear algebra kernel of an interior point method to avoid the explicit use of problem matrices. The only access to the original problem data needed are the matrix-vector multiplications with the Hessian and Jacobian matrices. Such a redesign requires the use of suitably preconditioned iterative methods and imposes restrictions on the way the preconditio...
متن کاملA primal-dual regularized interior-point method for convex quadratic programs
Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear systems which are used to derive search directions. Safeguards are typically required in order to handle free variables or rank-deficient Jacobians. We propose a consistent framework and accompanying theoretical justification for regularizing the...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 137 شماره
صفحات -
تاریخ انتشار 2013